Inductive benchmarking for purely functional data structures
نویسندگان
چکیده
منابع مشابه
Inductive benchmarking for purely functional data structures
Every designer of a new data structure wants to know how well it performs in comparison with others. But finding, coding and testing applications as benchmarks can be tedious and time-consuming. Besides, how a benchmark uses a data structure may considerably affect its apparent efficiency, so the choice of applications may bias the results. We address these problems by developing a tool for ind...
متن کاملBenchmarking purely functional data structures
When someone designs a new data structure, they want to know how well it performs. Previously, the only way to do this involves nding, coding and testing some applications to act as benchmarks. This can be tedious and time-consuming. Worse, how a benchmark uses a data structure may considerably a ect the e ciency of the data structure. Thus, the choice of benchmarks may bias the results. For th...
متن کاملPurely functional data structures
When a C programmer needs an efficient data structure for a particular problem, he or she can often simply look one up in any of a number of good textbooks or handbooks. Unfortunately, programmers in functional languages such as Standard ML or Haskell do not have this luxury. Although some data structures designed for imperative languages such as C can be quite easily adapted to a functional se...
متن کاملAutomated Benchmarking of Functional Data Structures
Despite a lot of recent interest in purely functional data structures, for example Ada93, Oka95, BO96, Oka96, OB97, Erw97], few have been benchmarked. Of these, even fewer have their performance qualiied by how they are used. But how a data structure is used can signiicantly aaect performance. This paper makes three original contributions. (1) We present an algorithm for generating a benchmark ...
متن کاملAuburn: A Kit for Benchmarking Functional Data Structures
Benchmarking competing implementations of a data structure can be both tricky and time consuming. The eeciency of an implementation may depend critically on how it is used. This problem is compounded by persistence. All purely functional data structures are persistent. We present a kit that can generate benchmarks for a given data structure. A benchmark is made from a description of how it shou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Programming
سال: 2001
ISSN: 0956-7968,1469-7653
DOI: 10.1017/s0956796801004063